Dynamical Behaviors of Rumor Spreading Model with Control Measures
نویسندگان
چکیده
منابع مشابه
Dynamical Model about Rumor Spreading with Medium
Rumor is a kind of social remark, that is untrue, and not be confirmed, and spreads on a large scale in a short time. Usually, it can induce a cloud of pressure, anxiety, and panic. Traditionally, it is propagated by word of mouth. Nowadays, with the emergence of the internet, rumors can be spread by instant messengers, emails, or publishing. With this new pattern of spreading, an ISRW dynamica...
متن کاملA Rumor Spreading Model with Control Mechanism on Social Networks
In this paper, considering a control mechanism that uses an anti-rumor spread to combat a rumor spread, a novel susceptible-infected (SI) model is developed. By means of mean-field theory, the early stage propagation dynamics of the rumor and the anti-rumor on homogeneous networks and inhomogeneous networks are investigated, respectively. Theoretical analysis and simulation results show that, i...
متن کاملRandomness-Efficient Rumor Spreading
We study the classical rumor spreading problem, which is used to spread information in an unknown network with n nodes. We present the first protocol for any expander graph G with n nodes and minimum degree Θ(n) such that, the protocol informs every node in O(log n) rounds with high probability, and uses O(log n log log n) random bits in total. The runtime of our protocol is tight, and the rand...
متن کاملRandomized Rumor Spreading
We investigate the class of so-called epidemic algorithms that are commonly used for the lazy transmission of updates to distributed copies of a database. These algorithms use a simple randomized communication mechanism to ensure robustness. Suppose n players communicate in parallel rounds in each of which every player calls a randomly selected communication partner. In every round, players can...
متن کاملRandomized Rumor Spreading Revisited
We develop a simple and generic method to analyze randomized rumor spreading processes in fully connected networks. In contrast to all previous works, which heavily exploit the precise definition of the process under investigation, we only need to understand the probability and the covariance of the events that uninformed nodes become informed. This universality allows us to easily analyze the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abstract and Applied Analysis
سال: 2014
ISSN: 1085-3375,1687-0409
DOI: 10.1155/2014/247359